Repository navigation
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
For the eight-limb signed half-sum CLEAR row at event 88937, the specialized reversible circuit uses 184,118 fewer gates and 71,422 fewer internal zero bits at signed width 1,076. This answers question 3 of SYLforge's #7687 for its representative row.
Evidence
Scoped proof and finite gate certificate. For every positive signed width w, seven signed additions or subtractions compute the numerator in w+3 bits. Its low bit gives the remainder. A bit slice supplies the quotient and two high-bit comparisons detect overflow. Copying the output and reversing the internal list restores all workspace even on invalid inputs. The construction uses 87w+199 gates and 14w+39 internal zero bits.
The local CPython 3.12.15 replay executed all donor tuples at widths one and two (256 and 65,536), plus 32 cases at width 1,076. The gate simulator compares every wire against signed integer arithmetic, including the target and diagnostic on negative odd and wrapped-overflow cases. The direct registered command took 0.17 s. Package replay and the six-file committed-byte/source-history preflight passed for
bc860f3314d9e94dda743c6ba4b3997a25d9264d.Run these commands from the repository root with CPython 3.12.
Scope
The result covers one real output coordinate. The row identification and comparison counts come from #7687. Gate-count optimality, rounded producer reachability, physical tape lowering, reset services and any change to κ remain open. No full native replay or proof-kernel run was performed.
Open next questions
What does the row cost with fixed tape positions and clean banks? Assign the work blocks to tapes and count the forward, copy and reverse scans, including initial allocation.
Related open work
CI notes
This PR carries the shared CI-doc and replay-gap sync used by other open PRs.
All six current-status tests and the registered historical replay-gap check passed locally. The plan, half-sum circuit replay and historical replay-gap replay all passed on
8f6279527c4362e2638737c90fa18c3cfec724fa. CI run 44363455119Merge scope
The research commit adds six files in the new package. A separate commit carries the five shared CI files.